A Study on Domination, Independent Domination and Irredundance in Fuzzy Graph
نویسندگان
چکیده
The domination number γ(G) of the fuzzy graph G is the minimum cardinality taken over all minimal dominating sets of G. The independent domination number i(G) is the minimum cardinality taken over all maximal independent sets of G. The irredundant number ir(G) is the minimum cardinality taken over all maximal irredundant sets of G. In this paper we prove the result that relate the parameters ir(G), γ(G) and i(G) Mathematics Subject Classification: 03E72, 05C69, 05C72
منابع مشابه
Independence Saturation and Extended Domination Chain in Graphs
The six basic parameters relating to domination, independence and irredundance satisfy a chain of inequalities given by ir ≤ γ ≤ i ≤ β0 ≤ Γ ≤ IR where ir, IR are the irredundance and upper irredundance numbers, γ,Γ are the domination and upper domination numbers and i, β0 are the independent domination number and independence number respectively. In this paper, we introduce the concept of indep...
متن کاملThe Domination Parameters of Cubic Graphs
Let ir(G), γ(G), i(G), β0(G), Γ(G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively. In this paper we show that for any integers k1, k2, k3, k4, k5 there exists a cubic graph G satisfying the following conditions: γ(G)−ir(G) ≥ k1, i(G)−...
متن کاملOn the differences of the independence, domination and irredundance parameters of a graph
In this paper we present upper bounds on the differences between the independence, domination and irredundance parameters of a graph. For example, using the Brooks theorem on the chromatic number, we show that for any graph G of order n with maximum degree ∆ ≥ 2 IR(G)− β(G) ≤ ⌊ ∆− 2 2∆ n ⌋ , where β(G) and IR(G) are the independence number and the upper irredundance number of a graph G, respect...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملFrom Irredundance to Annihilation: a Brief Overview of Some Domination Parameters of Graphs
During the last thirty years, the concept of domination in graphs has generated an impressive interest. A recent bibliography on the subject contains more than 1200 references and the number of new definitions is continually increasing. Rather than trying to give a catalogue of all of them, we survey the most classical and important notions (as independent domination, irredundant domination, k-...
متن کامل